Nonlinear Buyback Problem with Discrete Concave Valuation Functions
نویسندگان
چکیده
We discuss an online discrete optimization problem called the buyback problem. In the literature of the buyback problem, the valuation function representing the value of a set of selected elements is given by a linear function. In this paper, we consider a generalization of the buyback problem using a nonlinear valuation function. We propose an online algorithm for the problem with a discrete concave valuation function, and show that it achieves the same competitive ratio as the best possible ratio for a linear valuation function.
منابع مشابه
Logic-Based Methods for Global Optimization
Abstract. Logic-based methods provide a strategy for applying convex nonlinear programming to nonconvex global optimization. Such methods assume that the problem becomes convex when selected variables are fixed. The selected variables must be discrete, or else discretized if they are continuous. We provide a tutorial survey of disjunctive programming with convex relaxations, logic-based outer a...
متن کاملEfficiency Bounds for Sequential Wireless Resource Allocation Auctions
A sequential auction mechanism is proposed for sharing a wireless resource (bandwidth or power) among competing transmitters. The resource is assumed to be managed by a spectrum broker (auctioneer), who collects bids and allocates sequentially discrete units of the resource via second-price auctions. It is known that such auctions can have inefficient equilibria. For two users with full informa...
متن کاملA Parametric Approach for a Nonlinear Discrete Location Problem
A discrete location problem is formulated for the design of a postal service network. The cost objective of this problem includes a nonlinear concave component. A parametric integer programming algorithm is developed to find an approximate solution to the problem. The algorithm reduces the problem into a sequence of p-median problems and deals with the nonlinear cost by a node-replacement schem...
متن کاملPolynomial-Time Approximation Schemes for Maximizing Gross Substitutes Utility under Budget Constraints
We consider the maximization of a gross substitutes utility function under budget constraints. This problem naturally arises in applications such as exchange economies in mathematical economics and combinatorial auctions in (algorithmic) game theory. We show that this problem admits a polynomial-time approximation scheme (PTAS). More generally, we present a PTAS for maximizing a discrete concav...
متن کاملEfficiently Learning from Revealed Preference
In this paper, we consider the revealed preferences problem from a learning perspective. Every day, a price vector and a budget is drawn from an unknown distribution, and a rational agent buys his most preferred bundle according to some unknown utility function, subject to the given prices and budget constraint. We wish not only to find a utility function which rationalizes a finite set of obse...
متن کامل